Safe Neighborhood Computation for Hybrid System Verification
نویسندگان
چکیده
منابع مشابه
Safe Neighborhood Computation for Hybrid System Verification
Hybrid systems exhibit both discrete and continuous dynamics. The system state can flow continuously, and can also jump by triggering an event (transition). As an important application in the research of hybrid systems, safety verification is concerned with whether a specified set of unsafe states can be reached by the system from the initial set. One direct approach is to compute or over-appro...
متن کاملContract-Based Design for Computation and Verification of a Closed-Loop Hybrid System
Contract-based design is an approach where the design process is seen as a successive assembly of components where a component is represented in terms of assumptions about its environment and guarantees about its behavior. In the composition, if assumptions of each component are contained in guarantees offered by the others, then the composition is well formed. In this paper, we focus on contra...
متن کاملComputational techniques for hybrid system verification
This paper concerns computational methods for verifying properties of polyhedral invariant hybrid automata (PIHA), which are hybrid automata with discrete transitions governed by polyhedral guards. To verify properties of the state trajectories for PIHA, the planar switching surfaces are partitioned to define a finite set of discrete states in an approximate quotient transition system (AQTS). S...
متن کاملHybrid System verification in Coq
This internship is intended to improve the abstraction method described by Alur in [2], and implemented in Coq in Nimegen [5,7] for proving the safety of hybrid systems.
متن کاملSuper-Dense Computation in Verification of Hybrid CSP Processes
Hybrid Communicating Sequential Processes (HCSP) extends CSP to include differential equations and interruptions. We feel comfortable in our experience with HCSP to model scenarios of the Level 3 of Chinese Train Control System (CTCS-3), and to define a formal semantics for Simulink. The Hoare style calculus of [5] proposes a calculus to verify HCSP processes. However it has an error with respe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2015
ISSN: 2075-2180
DOI: 10.4204/eptcs.174.1